Modeling and solving multi-site scheduling problems
نویسنده
چکیده
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of the other sites to manufacture the products of the enterprise, e.g. in car or airplane manufacturing. In the multi site-scheduling scenario we differentiate between a global and a local scheduling level. On the global level a global schedule is generated providing the requirements for the local level schedulers. The local schedulers then have to transform the global schedule into a concrete local schedule for manufacturing. Different goals have to be regarded on the different levels. In case of unforeseen events rescheduling and manual interaction is necessary on both levels. Due to the distribution of the problem to several units scheduling as well as coordination problems have to be solved. This paper presents an approach that adopts modeling and problem solving techniques used for local scheduling problems for the new global scheduling problems. Additionally, specific problems are solved by new approaches, e.g., coordination using a blackboard, heuristic and fuzzy techniques dealing with the highly dynamic environment and the imprecise knowledge. The multi-site scheduling problem as well as selected results of the approaches on the different levels will be presented.
منابع مشابه
Modeling and solving multi-skilled resource-constrained project scheduling problem with calendars in fuzzy condition
In this study, we aim to present a new model for the resource-constrained project scheduling problem (RCPSP) considering a working calendar for project members and determined the skill factor of any member using the efficiency concept. For this purpose, the recyclable resources are staff resources where any person with multiple skills can meet the required skills of activities in a given time. ...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001